The Montgomery Modular Inverse-Revisited
نویسندگان
چکیده
We modify an algorithm given by Kaliski to compute the Montgomery inverse of an integer modulo a prime number. We also give a new definition of the Montgomery inverse, and introduce efficient algorithms for computing the classical modular inverse, the KaliskiMontgomery inverse, and the new Montgomery inverse. The proposed algorithms are suitable for software implementations on general-purpose microprocessors. Keywords— Modular arithmetic, modular inverse, almost inverse, Montgomery multiplication, cryptography.
منابع مشابه
New Algorithm for Classical Modular Inverse
The Montgomery inverse is used in cryptography for the computation of modular inverse of b modulo a, where a is a prime. We analyse existing algorithms from the point of view of their hardware implementation. We propose a new, hardware-optimal algorithm for the calculation of the classical modular inverse. The left-shift binary algorithm is shown to naturally calculate the classical modular inv...
متن کاملNew Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n)
approved: The computation of th GF(p) or GF(2), is one o applications. In this work, w the design of efficient hard inverse. We suggest a new c inverse algorithm to calcula a fast hardware algorithm proposed designs have the h on constrained areas and sti calculations, the module w module operates, can be se upper limit on the operand operands and internal resul infinite-precision Montgome We a...
متن کاملTurán's Problem 10 Revisited
∣ ≤ √ n+ 1. The method of proof combines a general lower bound (of Andersson), explicit arithmetical constructions (of Montgomery, Fabrykowski or Andersson), moments (probabilistic methods) and estimates for the difference of consecutive primes (of Baker-Harman-Pintz). We also prove some (conditional and unconditional) related results.
متن کاملEfficient Scalable Hardware Architecture for Montgomery Inverse Computation in Gf(p)
The Montgomery inversion is a fundamental computation in several cryptographic applications. In this work, we propose a scalable hardware architecture to compute the Montgomery modular inverse in GF(p). We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. The intended architecture is scalable, which means that a ...
متن کاملEfficient scalable VLSI architecture for Montgomery inversion in GF( p)
The multiplicative inversion operation is a fundamental computation in several cryptographic applications. In this work, we propose a scalable VLSI hardware to compute the Montgomery modular inverse in GF(p). We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. We also propose an efficient hardware algorithm to c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 49 شماره
صفحات -
تاریخ انتشار 2000